package cn.michael.dev.leetcode;

/**
 * Created by hufenggang on 2021/8/11.
 *
 * 问题描述：最小路径之和
 */
public class Problem64 {


    /**
     * 递归思路解法
     *
     * @param grid
     * @return
     */
    public int minPathSum2(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;


        return 0;

    }

    private int getMin(int[][] grid, int i, int j) {
        return 0;
    }
}
